Matching a set of strings with variable length don't cares

Matching a Set of Strings with Variable Length Don't Cares

Given an alphabet A, a pattern p is a sequence (v l , . . . ,vm) of words from A* called keywords. We represent p as a single word vl@.. 9 @vm, where @ ~ A is a distinguished symbol called variable length don't care symbol. Pattern p is said to match a text t E A* if t = UoVlUa...um_xv,~u,~ for some u0 , . . . ,u ,~ E A' . In this paper we address the following problem: given a set P of pattern...

A faster algorithm for matching a set of patterns with variable length don't cares

a r t i c l e i n f o a b s t r a c t We present a simple and faster solution to the problem of matching a set of patterns with variable length don't cares. Given an alphabet Σ, a pattern p is a word p 1 @p 2 · · · @p m , where p i is a string over Σ called a keyword and @ / ∈ Σ is a symbol called a variable length don't care (VLDC) symbol. Pattern p matches a text t if t = u 0 p 1 u 1. .. u m−...

Finding Patterns with Variable Length Gaps or Don't Cares

In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our algorithm works in O(n + m + α log(max1<=i<=l(bi − ai))) time where n is the length of the text, m is the summation of the lengths of the component subpatterns, α is the total number of occurrences ...

String Matching with Variable Length Gaps

We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P . This problem is a basic primitive in computational biology applications. Let m and n be the lengths of P and T , respective...

Online Dictionary Matching with Variable-Length Gaps